On root finding algorithms for complex functions with branch cuts
نویسندگان
چکیده
منابع مشابه
On quality of implementation of Fortran 2008 complex intrinsic functions on branch cuts
Branch cuts in complex functions in combination with signed zero and signed infinity have important uses in fracture mechanics, jet flow and aerofoil analysis. We present benchmarks for validating Fortran 2008 complex functions LOG, SQRT, ASIN, ACOS, ATAN, ASINH, ACOSH and ATANH on branch cuts with arguments of all 3 IEEE floating point binary formats: binary32, binary64 and binary128. Results ...
متن کاملVerification in the presence of complex numbers , functions with branch cuts etc
In considering the reliability of numerical programs, it is normal to “limit our study to the semantics dealing with numerical precision” (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that essentially ignores the numerics. The thesis of this paper is that there is a class of problems that fall between these two, which could be described as “does...
متن کامل7 Branch Cuts for Complex Elementary Functions or Much Ado About Nothing ' s Sign Bit
Zero has a usab Ie sign bi t on some computers, but not on others. This accident of computer arithmetic influences the definition and use of familiar complex elementary functions like V, arctan and arccosh whose domains are the whole complex plane with a slit or two drawn in it. The Principal Values of those functions are defined in terms of the logarithm function from which they inherit discon...
متن کاملTwo Algorithms for Root Finding in
We present two algorithms for computing the root, or equivalently the xed point, of a function in exact real arithmetic. The rst algorithm uses the iteration of the expression tree representing the function in real arithmetic based on linear fractional transformations and exact oating point. The second and more general algorithm is based on a trisection of intervals and can be compared with the...
متن کاملGradient algorithms for finding common Lyapunov functions
This paper is concerned with the problem of finding a quadratic common Lyapunov function for a large family of stable linear systems. We present gradient iteration algorithms which give deterministic convergence for finite system families and probabilistic convergence for infinite families.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2017
ISSN: 0377-0427
DOI: 10.1016/j.cam.2016.10.015